Resistance distance in wheels and fans
نویسندگان
چکیده
Abstract: The wheel graph is the join of a single vertex and a cycle, while the fan graph is the join of a single vertex and a path. The resistance distance between any two vertices of a wheel and a fan are obtained. The resistances are related to Fibonacci numbers and generalized Fibonacci numbers. The derivation is based on evaluating determinants of submatrices of the Laplacian matrix. A combinatorial argument is also illustrated. A connection with the problem of squaring a rectangle is described.
منابع مشابه
Tutte polynomials of wheels via generating functions
We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.
متن کاملWirelength of 1-fault hamiltonian graphs into wheels and fans
In this paper we obtain a fundamental result to find the exact wirelength of 1-fault hamiltonian graphs into wheels and fans. Using this result we compute the exact wirelength of circulant graphs, generalized petersen graphs, augmented cubes, crossed cubes, mőbius cubes, locally twisted cubes, twisted cubes, twisted n-cubes, generalized twisted cubes, hierarchical cubic networks, alternating gr...
متن کاملAnalysis of motor fan radiated sound and vibration waveform by automatic pattern recognition technique using “Mahalanobis distance”
In recent years, as the weight of IT equipment has been reduced, the demand for motor fans for cooling the interior of electronic equipment is on the rise. Sensory test technique by inspectors is the mainstream for quality inspection of motor fans in the field. This sensory test requires a lot of experience to accurately diagnose differences in subtle sounds (sound pressures) of the fans, and t...
متن کاملA note on "Folding wheels and fans."
In [6] Gervacio, Guerrero and Rara obtained formulas for the size of the largest clique onto which a graph G folds. We prove an interpolation lemma which simplifies some of their arguments and we correct a mistake in their formula for wheels.
متن کاملℤk-magic labellings of fans and wheels with magic value zero
Z k-magic labelings of fans and wheels with magic-value zero Abstract Let A be a non-trivial abelian group and A * = A − {0}. A graph is A-magic if there exists an edge labeling using elements of A * which induces a constant vertex labeling of the graph. For fan graphs F n and wheel graphs W n , we determine the sets of numbers k ∈ N, where F n and W n have Z k-magic labelings with magic-value 0.
متن کامل